NP-complete problems

Results: 1536



#Item
741NP-complete problems / Network theory / Operations research / Travelling salesman problem / Motion planning / Robotics / Shortest path problem / Mobile robot / Robot / Theoretical computer science / Mathematics / Graph theory

Ann Math Artif Intell:281–305 DOIs10472A framework for multi-robot node coverage in sensor networks Andrea Gasparri · Bhaskar Krishnamachari ·

Add to Reading List

Source URL: robotics.usc.edu

Language: English - Date: 2014-06-13 19:42:54
742Constraint programming / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Satisfiability Modulo Theories / AMPL / X Window System / Theoretical computer science / Computing / Software engineering

Programming with constraint solvers toward a shared infrastructure for code checking, angelic execution, debugging, and synthesis

Add to Reading List

Source URL: homes.cs.washington.edu

Language: English - Date: 2014-08-13 19:27:02
743NP-complete problems / Graph coloring / Graph theory / NP-complete / One-in-three 3SAT / 2-satisfiability / Theoretical computer science / Mathematics / Computational complexity theory

manhat-conn-xact-color.dvi

Add to Reading List

Source URL: daniel-wilkerson.appspot.com

Language: English
744Approximation algorithms / Cluster analysis / Combinatorial optimization / NP-complete problems / Complexity classes / Correlation clustering / Consensus clustering / Optimization problem / Minimum k-cut / Theoretical computer science / Computational complexity theory / Statistics

A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
745NP-complete problems / Applied mathematics / Graph theory / Theoretical computer science / Mathematics / Graph coloring

Introduction Extensions of G RAPH M OTIF MIN-SUB and MIN-ADD CGM Conclusion

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2011-09-22 14:07:17
746Sudoku / NP-complete problems / Puzzle / Number / Fibonacci number / Mathematics of Sudoku / Sudoku algorithms / Mathematics / Logic puzzles / Recreational mathematics

Generalising Number Patterns Seven Series-ous Secrets Teacher’s Notes These exercises, activities and games are designed for students to use independently or in small groups to practise number properties. Some involve

Add to Reading List

Source URL: schools.reap.org.nz

Language: English - Date: 2014-10-23 07:13:05
747Distributed computing architecture / MapReduce / Parallel computing / NP-complete problems / PageRank / Eulerian path / Graph / Topological graph theory / Connected component / Graph theory / Mathematics / Theoretical computer science

Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland, College Park {jimmylin,mschatz}@umd.edu

Add to Reading List

Source URL: www.umiacs.umd.edu

Language: English - Date: 2010-08-02 09:34:23
748Analysis of algorithms / Parameterized complexity / NP-complete problems / Kernelization / Time complexity / Vertex cover / Algorithm / Approximation algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics

A Linear Kernel for the Complementary Maximal Strip Recovery Problem Binhai Zhu Computer Science Department

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2012-12-29 15:19:34
749NP-complete problems / Graph partition / Graph / Connected component / Cluster analysis / Graph coloring / Planar separator theorem / Consensus clustering / Graph theory / Theoretical computer science / Mathematics

A First Step Towards Resilient Graph Partitioning for Electrical Grids Nana Arizumi, Kazuhiro Minami, Tomoya Tanjo, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {arizumi, kminami, tanjo, hm2

Add to Reading List

Source URL: systemsresilience.org

Language: English - Date: 2014-12-15 22:25:04
750NP-complete problems / Graph coloring / Connectivity / Graph / Topology / Graph theory / Theoretical computer science / Mathematics

Introduction Parameterized Algorithms Parameterized Hardness

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2008-06-13 19:09:20
UPDATE